Optimality Conditions for Multiobjective Programming with Generalized (zeta, rho, theta)-Convex Set Functions
نویسندگان
چکیده
Necessary conditions for Pareto optimality in multiobjective programming with subdifferentiable set functions are established in Theorem 12 of H. C. Lai and L. J. Ž . Lin J. Math. Anal. Appl. 132, 1988, 558]571 . In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfied; for Ž . instance I , r, u -convexity is assumed for both objective and constraint set functions. Some duality models are also discussed. Wolfe-type and Mond]Weir-type duality theorems are proved. Q 1997 Academic Press
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملOptimality Conditions and Duality in Nonsmooth Multiobjective Programs
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions. Two types of Karush-Kuhn-Tucker optimality conditions with support functions are introduced. Sufficient optimality conditions are presented by using generalized convexity and certain regularity conditions. We formulate Wolfe-type dual and Mond-Weirtype dual problems for our nonsmo...
متن کامل